An Algorithm for Large Set Partitioning Problems
نویسندگان
چکیده
منابع مشابه
An Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems
Metaheuristic algorithms, such as simulated annealing, tabu search and evolutionary algorithms, are popular techniques for solving optimization problems when exact methods are not practical. For example, the run times required to obtain exact solutions to many common combinatorial problems grow exponentially (or worse) with the problem size, and as a result, solving even a relatively modest siz...
متن کاملGenetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a single useful subset of features. This paper presents a novel feature set partitioning approach that is based on a genetic algorithm. As part of this new approach a new encoding schema is also proposed and its properti...
متن کاملRank-Cluster-and-Prune: An Algorithm for Generating Clusters in Complex Set Partitioning Problems
Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same cha...
متن کاملTighter Representations for Set Partitioning Problems
In this paper, we consider the set partitioning polytope and we begin by applying the reformulation-linearization technique of Sherali and Adams (1990, 1994) to generate a specialized hierarchy of relaxations by exploiting the structure of this polytope. We then show that several known classes of valid inequalities for this polytopc, as well as related tightening and composition rules, are auto...
متن کاملA Genetic Algorithm for the Set Partitioning
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem. The set partitioning problem is an important combinatorial optimisation problem used by many airlines as a mathematical model for ight crew scheduling. We develop a steady-state genetic algorithm in conjunction with a specialised heuristic feasibility operator for solving the set partitioning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1974
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.20.5.774